41![Algorithms for Designing Pop-Up Cards Zachary Abel∗ Anna Lubiw‡ Erik D. Demaine† Andr´e Schulz§ Algorithms for Designing Pop-Up Cards Zachary Abel∗ Anna Lubiw‡ Erik D. Demaine† Andr´e Schulz§](https://www.pdfsearch.io/img/0ee78e92fc8e5e220a9ea2a52fd7f59a.jpg) | Add to Reading ListSource URL: giovanniviglietta.comLanguage: English - Date: 2013-05-16 16:47:06
|
---|
42![Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel and Erik D. Demaine, CCCG 2011
Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel and Erik D. Demaine, CCCG 2011](https://www.pdfsearch.io/img/95bade39f26e5e6195138b0e753359f7.jpg) | Add to Reading ListSource URL: zacharyabel.com- Date: 2016-01-24 17:37:25
|
---|
43![The Distance Geometry of Deep Rhythms and Scales Erik D. Demaine∗ Perouz Taslakian§ Francisco Gomez-Martin† Godfried T. Toussaint§ The Distance Geometry of Deep Rhythms and Scales Erik D. Demaine∗ Perouz Taslakian§ Francisco Gomez-Martin† Godfried T. Toussaint§](https://www.pdfsearch.io/img/ee748f309baaa0abad530a3b2ca416db.jpg) | Add to Reading ListSource URL: student.ulb.ac.beLanguage: English - Date: 2009-03-10 11:24:53
|
---|
44![6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 7 — September 25, 2014 Prof. Erik Demaine 6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 7 — September 25, 2014 Prof. Erik Demaine](https://www.pdfsearch.io/img/ba579c118635440e072d8db5fc21ba04.jpg) | Add to Reading ListSource URL: courses.csail.mit.eduLanguage: English - Date: 2014-09-30 00:00:33
|
---|
45![Class 4 Scribe Notes Notetakers: Jason Ku, Yun William YuInstructor: Erik Demaine Class 4 Scribe Notes Notetakers: Jason Ku, Yun William YuInstructor: Erik Demaine](https://www.pdfsearch.io/img/f06558200c88174fd8254434e2621ae6.jpg) | Add to Reading ListSource URL: courses.csail.mit.eduLanguage: English - Date: 2014-09-22 02:27:09
|
---|
46![6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 12 — October 14, 2014 Prof. Erik Demaine 6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 12 — October 14, 2014 Prof. Erik Demaine](https://www.pdfsearch.io/img/fb7dc34b1b1153e3d21bfc48ea9bd7a0.jpg) | Add to Reading ListSource URL: courses.csail.mit.eduLanguage: English - Date: 2014-10-19 02:26:10
|
---|
47![CCCG 2006, Kingston, Ontario, August 14–16, 2006 Curves in the Sand: Algorithmic Drawing Mirela Damian∗ Erik D. Demaine† CCCG 2006, Kingston, Ontario, August 14–16, 2006 Curves in the Sand: Algorithmic Drawing Mirela Damian∗ Erik D. Demaine†](https://www.pdfsearch.io/img/5128aa53766492ec14f37712bf6be2fb.jpg) | Add to Reading ListSource URL: student.ulb.ac.beLanguage: English - Date: 2009-03-10 11:24:51
|
---|
48![Deflating The Pentagon Erik D. Demaine∗ Martin L. Demaine∗ Diane L. Souvaine† Deflating The Pentagon Erik D. Demaine∗ Martin L. Demaine∗ Diane L. Souvaine†](https://www.pdfsearch.io/img/4b8528c3367879c44624c0cddc49e13b.jpg) | Add to Reading ListSource URL: homepages.ulb.ac.beLanguage: English - Date: 2009-03-10 11:24:55
|
---|
49![Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine Computer Science and AI Laboratory Massachusetts Institute of Technology {edemaine,mdemaine}@mit.edu Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine Computer Science and AI Laboratory Massachusetts Institute of Technology {edemaine,mdemaine}@mit.edu](https://www.pdfsearch.io/img/f0612ca9fc4a78843f6fbe757d44d7ba.jpg) | Add to Reading ListSource URL: student.ulb.ac.beLanguage: English - Date: 2009-03-10 11:25:23
|
---|
50![Erratum for “Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs” Nadia M. Benbernou∗ Erik D. Demaine† Erratum for “Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs” Nadia M. Benbernou∗ Erik D. Demaine†](https://www.pdfsearch.io/img/fa8317f825b83cda3795a875827d5986.jpg) | Add to Reading ListSource URL: www.eecs.tufts.eduLanguage: English - Date: 2008-07-06 23:09:48
|
---|